T5-configurations and Non-rigid Sets of Matrices
نویسنده
چکیده
In 2003 B. Kirchheim-D. Preiss constructed a Lipschitz map in the plane with 5 incompatible gradients, where incompatibility refers to the condition that no two of the five matrices are rank-one connected. The construction is via the method of convex integration and relies on a detailed understanding of the rank-one geometry resulting from a specific set of five matrices. The full computation of the rank-one convex hull for this specific set was later carried out in 2010 by W. Pompe [Pom10] by delicate geometric arguments. For more general sets of matrices a full computation of the rank-one convex hull is clearly out of reach. Therefore, in this short note we revisit the construction and propose a new, in some sense generic method for deciding whether convex integration for a given set of matrices can be carried out, which does not require the full computation of the rank-one convex hull.
منابع مشابه
Finite configurations in sparse sets
Let E ⊆ Rn be a closed set of Hausdorff dimension α. For m ≥ n, let {B1, . . . , Bk} be n× (m−n) matrices. We prove that if the system of matrices Bj is non-degenerate in a suitable sense, α is sufficiently close to n, and if E supports a probability measure obeying appropriate dimensionality and Fourier decay conditions, then for a range of m depending on n and k, the set E contains a translat...
متن کاملA note on approximation conditions, standard triangularizability and a power set topology
The main result of this article is that for collections of entry-wise non-negative matrices the property of possessing a standard triangularization is stable under approximation. The methodology introduced to prove this result allows us to offer quick proofs of the corresponding results of [B. R. Yahaghi, Near triangularizability implies triangularizability, Canad. Math. Bull. 47, (2004), no. 2...
متن کاملAnalytical aspects of the interval unilateral quadratic matrix equations and their united solution sets
This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...
متن کاملOn Rigid Matrices and Subspace Polynomials
We introduce a class of polynomials, which we call subspace polynomials and show that the problem of explicitly constructing a rigid matrix can be reduced to the problem of explicitly constructing a small hitting set for this class. We prove that small-bias sets are hitting sets for the class of subspace polynomials, though their size is larger than desired. Furthermore, we give two alternative...
متن کاملSubknots in ideal knots, random knots, and knotted proteins
We introduce disk matrices which encode the knotting of all subchains in circular knot configurations. The disk matrices allow us to dissect circular knots into their subknots, i.e. knot types formed by subchains of the global knot. The identification of subknots is based on the study of linear chains in which a knot type is associated to the chain by means of a spatially robust closure protoco...
متن کامل